Cutting Stock with Bounded Open Stacks: a New Integer Linear Programming Model
نویسندگان
چکیده
We address a 1-dimensional cutting stock problem where, in addition to trimloss minimization, we require that the set of cutting patterns forming the solution can be sequenced so that the number of stacks of parts maintained open throughout the process never exceeds a given s. For this problem, we propose a new integer linear programming formulation whose constraints grow quadratically with the number of distinct part types.
منابع مشابه
A Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning
The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...
متن کاملA new method to determine a well-dispersed subsets of non-dominated vectors for MOMILP problem
Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...
متن کاملIn situ column generation for a cutting-stock problem
Working with an integer bilinear programming formulation of a one-dimen-sional cutting-stock problem, we develop an ILP-based local-search heuristic. The ILPs holistically integrate the master and subproblem of the usual price driven pattern-generation paradigm, resulting in a unified model that generates new patterns in situ. We work harder to generate new columns, but we are guaranteed that n...
متن کاملAls Manuskript Gedruckt Technische Universität Dresden Herausgeber: Der Rektor Theoretical Investigations on the Modified Integer Round-up Property for the One-dimensional Cutting Stock Problem
Many numerical computations show an only small difference between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modified integer round-up property (MIRUP) and present some results on subproblems having the MIRUP.
متن کاملSolving the Assortment and Trim Loss Problem with Branch-and-Price-and-Cut
In this paper, we address the combined assortment and trim loss minimization problem. In real settings, when different stock lengths are available, a common problem is to select a subset of stock lengths from which to cut the ordered items. In the cutting and packing literature, this problem is known as the assortment problem. Solving the assortment and trim loss minimization problem in a singl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010